SCSTallocator: Sized and Call-Site Tracing-Based Shared Memory Allocator for False Sharing Reduction in Page-Based DSM Systems

نویسندگان

  • Jongwoo Lee
  • Young-Ho Park
  • Yongik Yoon
چکیده

False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover, the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in page-based DSM systems, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose sized and call-site tracing-based shared memory allocator, shortly SCSTallocator. SCSTallocator expects that the data objects requested from the different call-sites may have different access patterns in the future. So SCSTallocator places each data object requested from the different call-sites into the separate shared pages, and consequently data objects that have the same call-site are likely to get together into the same shared pages. At the same time SCSTallocator places each data object that has different size into different shared pages to prohibit the different-sized objects from being allocated to the same shared page. We use execution-driven simulation of real parallel applications to evaluate the effectiveness of our SCSTallocator. Our observations show that our SCSTallocator outperforms the existing dynamic shared memory allocators. By combining the two existing allocation technique, we can reduce a considerable amount of false sharing misses.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BOPS Balancing Objects and Pages in a Shared Space

Distributed Shared Memory DSM systems usually employ a number of hardware pages as management units The gap between the size of application objects and coherence units leads to the undesirable e ect of false sharing resulting in a signi cant performance degradation for a wide range of applications To prevent false sharing and reduce the scope of consistency actions some systems introduce object...

متن کامل

A False-Sharing Free Distributed Shared Memory Management Scheme

Distributed shared memory (DSM) systems on top of network of workstations are especially vulnerable to the impact of false sharing because of their higher memory transaction overheads and thus higher false sharing penalties. In this paper we develop a dynamic-granularity shared memory management scheme that eliminates false sharing without sacrificing the transparency to conventional shared-mem...

متن کامل

A Data Reorganization Technique for Improving Data Locality of Irregular Applications in Software Distributed Shared Memory

Irregular applications are characterized by highly irregular and ne-grained data referencing patterns. When there is poor locality between the ne-grained data, serious false sharing can occur which has largely contributed to poor performance of irregular applications on page-based software distributed shared memory (DSM) systems. Partitioning data in irregular applications to improve data local...

متن کامل

Home-based Release Consistency in Object-based Software DSM Systems

This paper discusses the application of consistency models in objectbased software distributed shared memory (DSM) systems. In particular, we propose a home-based release consistency protocol as applied to our object-based software DSM system Rthreads (Remote threads). Access to shared data is performed in the Rthreads programs by explicit read/write operations. Global data structures are expli...

متن کامل

Region-based Software Distributed Shared Memory

In this paper, we describe the implementation of a software-based DSM model that supports variable-sized shard “regions”, where a region is a logical page that can be adjusted according to the access patterns of the user program. Our project supports the multiple reader, single writer (MRWS) replication algorithm, and uses a least-recentlyused (LRU) region replacement model. We found that our D...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007